Spatiotemporal prediction for bidirectionally predictive (b) pictures and motion vector prediction for multi-picture reference motion compensation

ABSTRACT

Several improvements for use with Bidirectionally Predictive (B) pictures within a video sequence are provided. In certain improvements Direct Mode encoding and/or Motion Vector Prediction are enhanced using spatial prediction techniques. In other improvements Motion Vector prediction includes temporal distance and subblock information, for example, for more accurate prediction. Such improvements and other presented herein significantly improve the performance of any applicable video coding system/logic.

RELATED PATENT APPLICATIONS

This U.S. Non-provisional application for Letters Patent claims the benefit of priority from, and hereby incorporates by reference the entire disclosure of, co-pending U.S. Provisional Application for Letters Patent Ser. No. 60/385,965, filed Jun. 3, 2002, and titled “Spatiotemporal Prediction for Bidirectionally Predictive (B) Frames and Motion Vector Prediction for Multi-Frame Reference Motion Compensation”.

TECHNICAL FIELD

This invention relates to video coding, and more particularly to methods and apparatuses for providing improved coding and/or prediction techniques associated with different types of video data.

BACKGROUND

The motivation for increased coding efficiency in video coding has led to the adoption in the Joint Video Team (JVT) (a standards body) of more refined and complicated models and modes describing motion information for a given macroblock. These models and modes tend to make better advantage of the temporal redundancies that may exist within a video sequence. See, for example, ITU-T, Video Coding Expert Group (VCEG), “JVT Coding—(ITU-T H.26L & ISO/IEC JTC 1 Standard)—Working Draft Number 2 (WD-2)”, ITU-T JVT-B118, March 2002; and/or Heiko Schwarz and Thomas Wiegand, “Tree-structured macroblock partition”, Doc. VCEG-N17, December 2001.

There is continuing need for further improved methods and apparatuses that can support the latest models and modes and also possibly introduce new models and modes to take advantage of improved coding techniques.

SUMMARY

The above state needs and other are addressed, for example, by a method for use in encoding video data within a sequence of video frames. The method includes identifying at least a portion of at least one video frame to be a Bidirectionally Predictive (B) picture, and selectively encoding the B picture using at least spatial prediction to encode at least one motion parameter associated with the B picture. In certain exemplary implementations the B picture may include a block, a macroblock, a subblock, a slice, or other like portion of the video frame. For example, when a macroblock portion is used, the method produces a Direct Macroblock.

In certain further exemplary implementations, the method further includes employing linear or non-linear motion vector prediction for the B picture based on at least one reference picture that is at least another portion of the video frame. By way of example, in certain implementations, the method employs median motion vector prediction to produce at least one motion vector.

In still other exemplary implementations, in addition to spatial prediction, the method may also process at least one other portion of at least one other video frame to further selectively encode the B picture using temporal prediction to encode at least one temporal-based motion parameter associated with the B picture. In some instances the temporal prediction includes bidirectional temporal prediction, for example based on at least a portion of a Predictive (P) frame.

In certain other implementations, the method also selectively determines applicable scaling for a temporal-based motion parameter based at least in part on a temporal distance between the predictor video frame and the frame that includes the B picture. In certain implementations temporal distance information is encoded, for example, within a header or other like data arrangement associated with the encoded B picture.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention is illustrated by way of example and not limitation in the figures of the accompanying drawings. The same numbers are used throughout the figures to reference like components and/or features.

FIG. 1 is a block diagram depicting an exemplary computing environment that is suitable for use with certain implementations of the present invention.

FIG. 2 is a block diagram depicting an exemplary representative device that is suitable for use with certain implementations of the present invention.

FIG. 3 is an illustrative diagram depicting spatial predication associated with portions of a picture, in accordance with certain exemplary implementations of the present invention.

FIG. 4 is an illustrative diagram depicting Direct Prediction in B picture coding, in accordance with certain exemplary implementations of the present invention.

FIG. 5 is an illustrative diagram depicting what happens when a scene change happens or even when the collocated block is intra-coded, in accordance with certain exemplary implementations of the present invention.

FIG. 6 is an illustrative diagram depicting handling of collocated intra within existing codecs wherein motion is assumed to be zero, in accordance with certain exemplary implementations of the present invention.

FIG. 7 is an illustrative diagram depicting how Direct Mode is handled when the reference picture of the collocated block in the subsequent P picture is other than zero, in accordance with certain exemplary implementations of the present invention.

FIG. 8 is an illustrative diagram depicting an exemplary scheme wherein 9 MV_(FW) and MV_(BW) are derived from spatial prediction, in accordance with certain exemplary implementations of the present invention.

FIG. 9 is an illustrative diagram depicting how spatial prediction solves the problem of scene changes and the like, in accordance with certain exemplary implementations of the present invention.

FIG. 10 is an illustrative diagram depicting joint spatio-temporal prediction for Direct Mode in B picture coding, in accordance with certain exemplary implementations of the present invention.

FIG. 11 is an illustrative diagram depicting Motion Vector Prediction of a current block considering reference picture information of predictor macroblocks, in accordance with certain exemplary implementations of the present invention.

FIG. 12 is an illustrative diagram depicting how to use more candidates for Direct Mode prediction especially if bidirectional prediction is used within the B picture, in accordance with certain exemplary implementations of the present invention.

FIG. 13 is an illustrative diagram depicting how B pictures may be restricted in using future and past reference pictures, in accordance with certain exemplary implementations of the present invention.

FIG. 14 is an illustrative diagram depicting projection of collocated Motion Vectors to a current reference for temporal direct prediction, in accordance with certain exemplary implementations of the present invention.

FIGS. 15a-c are illustrative diagrams depicting Motion Vector Predictors for one MV in different configurations, in accordance with certain exemplary implementations of the present invention.

FIGS. 16a-c are illustrative diagrams depicting Motion Vector Predictors for one MV with 8×8 partitions in different configurations, in accordance with certain 12 exemplary implementations of the present invention.

FIGS. 17a-c are illustrative diagrams depicting Motion Vector Predictors for one MV with additional predictors for 8×8 partitioning, in accordance with certain exemplary implementations of the present invention.

DETAILED DESCRIPTION

Several improvements for use with Bidirectionally Predictive (B) pictures within a video sequence are described below and illustrated in the accompanying drawings. In certain improvements Direct Mode encoding and/or Motion Vector Prediction are enhanced using spatial prediction techniques. In other improvements Motion Vector prediction includes temporal distance and subblock information, for example, for more accurate prediction. Such improvements and other presented herein significantly improve the performance of any applicable video coding system/logic.

While these and other exemplary methods and apparatuses are described, it should be kept in mind that the techniques of the present invention are not limited to the examples described and shown in the accompanying drawings, but are also clearly adaptable to other similar existing and future video coding schemes, etc.

Before introducing such exemplary methods and apparatuses, an introduction is provided in the following section for suitable exemplary operating environments, for example, in the form of a computing device and other types of devices/appliances.

Exemplary Operational Environments:

Turning to the drawings, wherein like reference numerals refer to like elements, the invention is illustrated as being implemented in a suitable computing environment. Although not required, the invention will be described in the general context of computer-executable instructions, such as program modules, being executed by a personal computer.

Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Those skilled in the art will appreciate that the invention may be practiced with other computer system configurations, including hand-held devices, multi-processor systems, microprocessor based or programmable consumer electronics, network PCs, minicomputers, mainframe computers, portable communication devices, and the like.

The invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.

FIG. 1 illustrates an example of a suitable computing environment 120 on which the subsequently described systems, apparatuses and methods may be implemented. Exemplary computing environment 120 is only one example of a suitable computing environment and is not intended to suggest any limitation as to the scope of use or functionality of the improved methods and systems described herein. Neither should computing environment 120 be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in computing environment 120.

The improved methods and systems herein are operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well known computing systems, environments, and/or configurations that may be suitable include, but are not limited to, personal computers, server computers, thin clients, thick clients, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.

As shown in FIG. 1, computing environment 120 includes a general-purpose computing device in the form of a computer 130. The components of computer 130 may include one or more processors or processing units 132, a system memory 134, and a bus 136 that couples various system components including system memory 134 to processor 132.

Bus 136 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnects (PCI) bus also known as Mezzanine bus.

Computer 130 typically includes a variety of computer readable media. Such media may be any available media that is accessible by computer 130, and it includes both volatile and non-volatile media, removable and non-removable media.

In FIG. 1, system memory 134 includes computer readable media in the form of volatile memory, such as random access memory (RAM) 140, and/or non-volatile memory, such as read only memory (ROM) 138. A basic input/output system (BIOS) 142, containing the basic routines that help to transfer information between elements within computer 130, such as during start-up, is stored in ROM 138. RAM 140 typically contains data and/or program modules that are immediately accessible to and/or presently being operated on by processor 132.

Computer 130 may further include other removable/non-removable, volatile/non-volatile computer storage media. For example, FIG. 1 illustrates a hard disk drive 144 for reading from and writing to a non-removable, non-volatile magnetic media (not shown and typically called a “hard drive”), a magnetic disk drive 146 for reading from and writing to a removable, non-volatile magnetic disk 148 (e.g., a “floppy disk”), and an optical disk drive 150 for reading from or writing to a removable, non-volatile optical disk 152 such as a CD-ROM/R/RW, DVD-ROM/R/RW/+R/RAM or other optical media. Hard disk drive 144, magnetic disk drive 146 and optical disk drive 150 are each connected to bus 136 by one or more interfaces 154.

The drives and associated computer-readable media provide nonvolatile a storage of computer readable instructions, data structures, program modules, and other data for computer 130. Although the exemplary environment described herein employs a hard disk, a removable magnetic disk 148 and a removable optical disk 152, it should be appreciated by those skilled in the art that other types of computer readable media which can store data that is accessible by a computer, such as magnetic cassettes, flash memory cards, digital video disks, random access memories (RAMs), read only memories (ROM), and the like, may also be used in the exemplary operating environment.

A number of program modules may be stored on the hard disk, magnetic disk 148, optical disk 152, ROM 138, or RAM 140, including, e.g., an operating system 158, one or more application programs 160, other program modules 162, and program data 164.

The improved methods and systems described herein may be implemented within operating system 158, one or more application programs 160, other program modules 162, and/or program data 164.

A user may provide commands and information into computer 130 through input devices such as keyboard 166 and pointing device 168 (such as a “mouse”). Other input devices (not shown) may include a microphone, joystick, game pad, satellite dish, serial port, scanner, camera, etc. These and other input devices are connected to the processing unit 132 through a user input interface 170 that is coupled to bus 136, but may be connected by other interface and bus structures, such as a parallel port, game port, or a universal serial bus (USB).

A monitor 172 or other type of display device is also connected to bus 136 via an interface, such as a video adapter 174. In addition to monitor 172, personal computers typically include other peripheral output devices (not shown), such as speakers and printers, which may be connected through output peripheral interface 175.

Computer 130 may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 182. Remote computer 182 may include many or all of the elements and features described herein relative to computer 130.

Logical connections shown in FIG. 1 are a local area network (LAN) 177 and a general wide area network (WAN) 179. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets, and the Internet.

When used in a LAN networking environment, computer 130 is connected to LAN 177 via network interface or adapter 186. When used in a WAN networking environment, the computer typically includes a modem 178 or other means for establishing communications over WAN 179. Modem 178, which may be internal or external, may be connected to system bus 136 via the user input interface 170 or other appropriate mechanism.

Depicted in FIG. 1, is a specific implementation of a WAN via the Internet. Here, computer 130 employs modem 178 to establish communications with at least one remote computer 182 via the Internet 180.

In a networked environment, program modules depicted relative to computer 130, or portions thereof, may be stored in a remote memory storage device. Thus, e.g., as depicted in FIG. 1, remote application programs 189 may reside on a memory device of remote computer 182. It will be appreciated that the network connections shown and described are exemplary and other means of establishing a communications link between the computers may be used.

Attention is now drawn to FIG. 2, which is a block diagram depicting another exemplary device 200 that is also capable of benefiting from the methods and apparatuses disclosed herein. Device 200 is representative of any one or more devices or appliances that are operatively configured to process video and/or any related types of data in accordance with all or part of the methods and apparatuses described herein and their equivalents. Thus, device 200 may take the form of a computing device as in FIG. 1, or some other form, such as, for example, a wireless device, a portable communication device, a personal digital assistant, a video player, a television, a DVD player, a CD player, a karaoke machine, a kiosk, a digital video projector, a flat panel video display mechanism, a set-top box, a video game machine, etc. In this example, device 200 includes logic 202 configured to process video data, a video data source 204 configured to provide vide data to logic 202, and at least one display module 206 capable of displaying at least a portion of the video data for a user to view. Logic 202 is representative of hardware, firmware, software and/or any combination thereof. In certain implementations, for example, logic 202 includes a compressor/decompressor (codec), or the like. Video data source 204 is representative of any mechanism that can provide, communicate, output, and/or at least momentarily store video data suitable for processing by logic 202. Video reproduction source is illustratively shown as being within and/or without device 200. Display module 206 is representative of any mechanism that a user might view directly or indirectly and see the visual results of video data presented thereon. Additionally, in certain implementations, device 200 may also include some form or capability for reproducing or otherwise handling audio data associated with the video data. Thus, an audio reproduction module 208 is shown.

With the examples of FIGS. 1 and 2 in mind, and others like them, the next sections focus on certain exemplary methods and apparatuses that may be at least partially practiced using with such environments and with such devices.

Encoding Bidirectionally Predictive (B) Pictures and Motion Vector Prediction

This section describes several exemplary improvements that can be implemented to encode Bidirectionally Predictive (B) pictures and Motion Vector prediction within a video coding system or the like. The exemplary methods and apparatuses can be applied to predict motion vectors and enhancements in the design of a B picture Direct Mode. Such methods and apparatuses are particularly suitable for multiple picture reference codecs, such as, for example, JVT, and can achieve considerable coding gains especially for panning sequences or scene changes.

Bidirectionally Predictive (B) pictures are an important part of most video coding standards and systems since they tend to increase the coding efficiency of such systems, for example, when compared to only using Predictive (P) pictures. This improvement in coding efficiency is mainly achieved by the consideration of bidirectional motion compensation, which can effectively improve motion compensated prediction and thus allow the encoding of significantly reduced residue information. Furthermore, the introduction of the Direct Prediction mode for a Macroblock/block within such pictures can further increase efficiency considerably (e.g., more than 10-20%) since no motion information is encoded. Such may be accomplished, for example, by allowing the prediction of both forward and backward motion information to be derived directly from the motion vectors used in the corresponding macroblock of a subsequent reference picture.

By way of example, FIG. 4 illustrates Direct Prediction in B picture at time t+1 coding based on P frames at times t and t+2, and the applicable motion vectors (MVs). Here, an assumption is made that an object in the picture is moving with constant speed. This makes it possible to predict a current position inside a B picture without having to transmit any motion vectors. The motion vectors ({right arrow over (MV)}_(fw),{right arrow over (MV)}_(bw)) of the Direct Mode versus the motion vector {right arrow over (MV)} of the collocated MB in the first subsequent P reference picture are basically calculated by:

${{\overset{}{MV}}_{fw} = {{\frac{{TR}_{B} \cdot \overset{}{MV}}{{TR}_{D}}\mspace{14mu} {and}\mspace{14mu} {\overset{}{MV}}_{bw}} = \frac{\left( {{TR}_{B} - {TR}_{D}} \right) \cdot \overset{}{MV}}{{TR}_{D}}}},$

where TR_(B) is the temporal distance between the current B picture and the reference picture pointed by the forward MV of the collocated MB, and TR_(D) is the temporal distance between the future reference picture and the reference picture pointed by the forward MV of the collocated MB.

Unfortunately there are several cases where the existing Direct Mode does not provide an adequate solution, thus not efficiently exploiting the properties of this mode. In particular, existing designs of this mode usually force the motion parameters of the Direct Macroblock, in the case of the collocated Macroblock in the subsequent P picture being Intra coded, to be zero. For example, see FIG. 6, which illustrates handling of collocated intra within existing codecs wherein motion is assumed to be zero. This essentially means that, for this case, the B picture Macroblock will be coded as the average of the two collocated Macroblocks in the first subsequent and past P references. This immediately raises the following concern; if a Macroblock is Intra-coded, then how does one know how much relationship it has with the collocated Macroblock of its reference picture. In some situations, there may be little if any actual relationship. Hence, it is possible that the coding efficiency of the Direct Mode may be reduced. An extreme case can be seen in the case of a scene change as illustrated in FIG. 5. FIG. 5 illustrates what happens when a scene change occurs in the video sequence and/or what happens when the collocated block is intra. Here, in this example, obviously no relationship exists between the two reference pictures given the scene change. In such a case bidirectional prediction would provide little if any benefit. As such, the Direct Mode could be completely wasted. Unfortunately, conventional implementations of the Direct Mode restrict it to always perform a bidirectional prediction of a Macroblock.

FIG. 7 is an illustrative diagram depicting how Direct Mode is handled when the reference picture of the collocated block in the subsequent P picture is other than zero, in accordance with certain implementations of the present invention.

An additional issue with the Direct Mode Macroblocks exists when multi-picture reference motion compensation is used. Until recently, for example, the JVT standard provided the timing distance information (TR_(B) and TR_(D)), thus allowing for the proper scaling of the parameters. Recently, this was changed in the new revision of the codec (see, e.g., Joint Video Team (JVT) of ISO/IEC MPEG and ITU-T VCEG, “Joint Committee Draft (CD) of Joint Video Specification (ITU-T Rec. H.264|ISO/IEC 14496-10 AVC)”, ITU-T JVT-C167, May. 2002, which is incorporated herein by reference). In the new revision, the motion vector parameters of the subsequent P picture are to be scaled equally for the Direct Mode prediction, without taking in account the reference picture information. This could lead to significant performance degradation of the Direct Mode, since the constant motion assumption is no longer followed.

Nevertheless, even if the temporal distance parameters were available, it is not always certain that the usage of the Direct Mode as defined previously is the most appropriate solution. In particular for the B pictures which are closer to a first forward reference picture, the correlation might be much stronger with that picture, than the subsequent reference picture. An extreme example which could contain such cases could be a sequence where scene A changes to scene B, and then moves back to scene A (e.g., as may happen in a news bulletin, etc.). All the above could deter the performance of B picture encoding considerably since Direct Mode will not be effectively exploited within the encoding process.

With these and other concerns in mind, unlike the previous definitions of the Direct Mode where only temporal prediction was used, in accordance with certain aspects of the present invention, a new Direct Macroblock type is introduced wherein both temporal prediction and/or spatial prediction is considered. The type(s) of prediction used can depend on the type of reference picture information of the first subsequent P reference picture, for example.

In accordance with certain other aspects of the present invention, one may also further considerably improve motion vector prediction for both P and B pictures when multiple picture references are used, by taking in consideration temporal distances, if such are available.

These enhancements are implemented in certain exemplary methods and apparatuses as described below. The methods and apparatuses can achieve significant bitrate reductions while achieving similar or better quality.

Direct Mode Enhancements:

In most conventional video coding systems, Direct Mode is designed as a bidirectional prediction scheme where motion parameters are always predicted in a temporal way from the motion parameters in the subsequent P images. In this section, an enhanced Direct Mode technique is provided in which spatial information may also/alternatively be considered for such predictions.

One or more of the following exemplary techniques may be implemented as needed, for example, depending on the complexity and/or specifications of the system.

One technique is to implement spatial prediction of the motion vector parameters of the Direct Mode without considering temporal prediction. Spatial prediction can be accomplished, for example, using existing Motion Vector prediction techniques used for motion vector encoding (such as, e.g., median prediction). If multiple picture references are used, then the reference picture of the adjacent blocks may also be considered (even though there is no such restriction and the same reference, e.g. 0, could always be used).

Motion parameters and reference pictures could be predicted as follows and with reference to FIG. 3, which illustrates spatial predication associated with portions A-E (e.g., macroblocks, slices, etc.) assumed to be available and part of a picture. Here, E is predicted in general from A, B, C as Median (A,B,C). If C is actually outside of the picture then D is used instead. If B, C, and D are outside of picture, then only A is used, where as if A does not exist, such is replaced with (0,0). Those skilled in the art will recognize that spatial prediction may be done at a subblock level as well.

In general spatial prediction can be seen as a linear or nonlinear function of all available motion information calculated within a picture or a group of macroblocks/blocks within the same picture.

There are various methods available that may be arranged to predict the reference picture for Direct Mode. For example, one method may be to select a minimum reference picture among the predictions. In another method, a median reference picture may be selected. In certain methods, a selection may be made between a minimum reference picture and median reference picture, e.g., if the minimum is zero. In still other implementations, a higher priority could also be given to either vertical or horizontal predictors (A and B) due to their possibly stronger correlation with E.

If one of the predictions does not exist (e.g., all surrounding macroblocks are predicted with the same direction FW or BW only or are intra), then the existing one is only used (single direction prediction) or such could be predicted from the one available. For example if forward prediction is available then:

${\overset{}{MV}}_{bw} = \frac{\left( {{TR}_{B} - {TR}_{D}} \right) \cdot {\overset{}{MV}}_{fw}}{{TR}_{B}}$

Temporal prediction is used for Macroblocks if the subsequent P reference is non intra as in existing codecs. Attention is now drawn to FIG. 8, in which MV_(FW) and MV_(BW) are derived from spatial prediction (Median MV of surrounding Macroblocks). If either one is not available (i.e., no predictors) then one-direction is used. If a subsequent P reference is intra, then spatial prediction can be used instead as described above. Assuming that no restrictions exist, if one of the predictions is not available then Direct Mode becomes a single direction a prediction mode.

This could considerably benefit video coding when the scene changes, for example, as illustrated in FIG. 9, and/or even when fading exists within a video sequence. As illustrated in FIG. 9, spatial prediction may be used to solve the problem of a scene change.

If temporal distance information is not available within a codec, temporal prediction will not be as efficient in the direct mode for blocks when the collocated P reference block has a non-zero reference picture. In such a case, spatial prediction may also be used as above. As an alternative, one may estimate scaling parameters if one of the surrounding macroblocks also uses the same reference picture as the collocated P reference block. Furthermore, special handling may be provided for the case of zero motion (or close to zero motion) with a non-zero reference. Here, regardless of temporal distance forward and backward motion vectors could always be taken as zero. The best solution, however, may be to always examine the reference picture information of surrounding macroblocks and based thereon decide on how the direct mode should be handled in such a case.

More particularly, for example, given a non-zero reference, the following sub cases may be considered:

-   -   Case A: Temporal prediction is used if the motion vectors of the         collocated P block are zero.     -   Case B: If all surrounding macroblocks use different reference         pictures than the collocated P reference, then spatial         prediction appears to be a better choice and temporal prediction         is not used.     -   Case C: If motion flow inside the B picture appears to be quite         different than the one in the P reference picture, then spatial         prediction is used instead.     -   Case D: Spatial or temporal prediction of Direct Mode         macroblocks could be signaled inside the image header. A         pre-analysis of the image could be performed to decide which         should be used.     -   Case E: Correction of the temporally predicted parameters based         on spatial information (or vice versa). Thus, for example, if         both appear to have the same or approximately the same phase         information then the spatial information could be a very good         candidate for the direct mode prediction. A correction could         also be done on the phase, thus correcting the sub pixel         accuracy of the prediction.

FIG. 10 illustrates a joint spatio-temporal prediction for Direct Mode in B picture coding. Here, in this example, Direct Mode can be a 1- to 4-direction mode depending on information available. Instead of using Bi-directional prediction for Direct Mode macroblocks, a multi-hypothesis extension of such mode can be done and multiple predictions used instead.

Combined with the discussion above, Direct Mode macroblocks can be predicted using from one up to four possible motion vectors depending on the information available. Such can be decided, for example, based on the mode of the collocated P reference image macroblock and on the surrounding macroblocks in the current B picture. In such a case, if the spatial prediction is too different than the temporal one, one of them could be selected as the only prediction in favor of the other. Since spatial prediction as described previously, might favor a different reference picture than the temporal one, the same macroblock might be predicted from more than 2 reference pictures.

The JVT standard does not restrict the first future reference to be a P picture. Hence, in such a standard, a picture can be a B as illustrated in FIG. 12, or even a Multi-Hypothesis (MH) picture. This implies that more motion vectors are assigned per macroblock. This means that one may also use this property to increase the efficiency of the Direct Mode by more effectively exploiting the additional motion information.

In FIG. 12, the first subsequent reference picture is a B picture (pictures B₈ and B₉). This enables one to use more candidates for Direct Mode prediction especially if bidirectional prediction is used within the B picture.

In particular one may perform the following:

-   -   a.) If the collocated reference block in the first future         reference is using bidirectional prediction, the corresponding         motion vectors (forward or backward) are used for calculating         the motion vectors of the current block. Since the backward         motion vector of the reference corresponds to a future reference         picture, special care should be taken in the estimate of the         current motion parameters. Attention is drawn, for example to         FIG. 12 in which the first subsequent reference picture is a B         picture (pictures B₈ and B₉). This enables one to use more         candidates for Direct Mode prediction especially if         bidirectional prediction is used within the B picture. Thus, as         illustrated, the backward motion vector of B₈ {right arrow over         (MV)}_(B8bw) can be calculated as 2×{right arrow over         (MV)}_(B7bw) due to the temporal distance between B₈, B₇ and P₆.         Similarly for B₉ the backward motion vector can be taken as         {right arrow over (MV)}_(B7bw), if though these refer to the B₇.         One may also restrict these to refer to the first subsequent P         picture, in which case these motion vectors can be scaled         accordingly. A similar conclusion can be deduced about the         forward motion vectors. Multiple picture reference or intra         macroblocks can be handled similar to the previous discussion.     -   b.) If bidirectional prediction for the collocated block is         used, then, in this example, one may estimate four possible         predictions for one macroblock for the direct mode case by         projecting and inverting the backward and forward motion vectors         of the reference.     -   c.) Selective projection and inversion may be used depending on         temporal distance. According to this solution, one selects the         motion vectors from the reference picture which are more         reliable for the prediction. For example, considering the         illustration in FIG. 12, one will note that B₈ is much closer to         P₂ than P₆. This implies that the backward motion vector of B₇         may not be a very reliable prediction. In this case, direct mode         motion vectors can therefore be calculated only from the forward         prediction of B₇. For B₉, however, both motion vectors seem to         be adequate enough for the prediction and therefore may be used.         Such decisions/information may also be decided/supported within         the header of the image. Other conditions and rules may also be         implemented. For example, additional spatial confidence of a         prediction and/or a motion vector phase may be considered. Note,         in particular, that if the forward and backward motion vectors         have no relationship, then the backward motion vector might be         too unreliable to use.

Single Picture Reference for B Pictures:

A special case exists with the usage of only one picture reference for B pictures (although, typically a forward and a backward reference are necessary) regardless of how many reference pictures are used in P pictures. From observations of encoding sequences in the current JVT codec, for example, it was noted that, if one compares the single-picture reference versus the multi-picture reference case using B pictures, even though encoding performance of P pictures for the multi-picture case is almost always superior to that of the single-picture, the some is not always true for B pictures.

One reason for this observation is the overhead of the reference picture used for each macroblock. Considering that B pictures rely more on motion information than P pictures, the reference picture information overhead reduces the number of bits that are transmitted for the residue information at a given bitrate, which thereby reduces efficiency. A rather easy and efficient solution could be the selection of only one picture reference for either backward or forward motion compensation, thus not needing to transmit any reference picture information.

This is considered with reference to FIGS. 13 and 14. As illustrated in FIG. 13, B pictures can be restricted in using only one future and past reference pictures. Thus, for direct mode motion vector calculation, projection of the motion vectors is necessary. A projection of the collocated MVs to the current reference for temporal direct prediction is illustrated in FIG. 14 (note that it is possible that TD_(D,0)>TD_(D,1)). Thus, in this example, Direct Mode motion parameters are calculated by projecting motion vectors that refer to other reference pictures to the two reference pictures, or by using spatial prediction as in FIG. 13. Note that such options not only allow for possible reduced encoding complexity of B pictures, but also tend to reduce memory requirements since fewer B pictures (e.g., maximum two) are needed to be stored if B pictures are allowed to reference B pictures.

In certain cases a reference picture of the first future reference picture may no longer be available in the reference buffer. This could immediately generate a problem for the estimate of Direct Mode macroblocks and special handling of such cases is required. Obviously there is no such problem if a single picture reference is used. However, if multiple picture references are desired, then possible solutions include projecting the motion vector(s) to either the first forward reference picture, and/or to the reference picture that was closest to the non available picture. Either solution could be viable, whereas again spatial prediction as could be an alternative solution.

Refinements of the Motion Vector Prediction for Single- and Multi-Picture Reference Motion Compensation

Motion vector prediction for multi-picture reference motion compensation can significantly affect the performance of both B and P picture coding. Existing standards, such as, for example, JVT, do not always consider the reference pictures of the macroblocks used in the prediction. The only consideration such standards do make is when only one of the prediction macroblocks uses the same reference. In such a case, only that predictor is used for the motion prediction. There is no consideration of the reference picture if only one or all predictors are using a different reference.

In such a case, for example, and in accordance with certain further aspects of the present invention, one can scale the predictors according to their temporal distance versus the current reference. Attention is drawn to FIG. 11, which illustrates Motion Vector prediction of a current block (C) considering the reference picture information of predictor macroblocks (Pr) and performance of proper adjustments (e.g., scaling of the predictors).

If predictors A, B, and C use reference pictures with temporal distance TR_(A), TR_(B), and TR_(C) respectively, and the current reference picture has a temporal distance equal to TR, then the median predictor is calculated as follows:

${\overset{}{MV}}_{pred} = {{TR} \times {{Median}\left( {\frac{{\overset{}{MV}}_{A}}{{TR}_{A}},\frac{{\overset{}{MV}}_{B}}{{TR}_{B}},\frac{{\overset{}{MV}}_{C}}{{TR}_{C}}} \right)}}$

If integer computation is to be used, it may be easier to place the multiplication inside the median, thus increasing accuracy. The division could also be replaced with shifting, but that reduces the performance, whereas it might be necessary to handle signed shifting as well (−1>>N=−1). It is thus very important in such cases to have the temporal distance information available for performing the appropriate scaling. Such could also be available within the header, if not predictable otherwise.

Motion Vector prediction as discussed previously is basically median biased, meaning that the median value among a set of predictors is selected for the prediction. If one only uses one type of macroblock (e.g., 16×16) with one Motion Vector (MV), then these predictors can be defined, for example, as illustrated in FIG. 15. Here, MV predictors are shown for one MV. In FIG. 15a , the MB is not in the first row or the last column. In FIG. 15b , the MB is in the last column. In FIG. 15c , the MB is in the first row.

The JVT standard improves on this further by also considering the case that only one of the three predictors exists (i.e. Macroblocks are intra or are using a different reference picture in the case of multi-picture prediction). In such a case, only the existing or same reference predictor is used for the prediction and all others are not examined.

Intra coding does not always imply that a new object has appeared or that scene changes. It might instead, for example, be the case that motion estimation and compensation is inadequate to represent the current object (e.g., search range, motion estimation algorithm used, quantization of residue, etc) and that better results could be achieved through Intra Coding instead. The available motion predictors could still be adequate enough to provide a good motion vector predictor solution.

What is intriguing is the consideration of subblocks within a Macroblock, with each one being assigned different motion information. MPEG-4 and H.263 standards, for example, can have up to four such subblocks (e.g., with size 8×8), where as the JVT standard allows up to sixteen subblocks while also being able to handle variable block sizes (e.g., 4×4, 4×8, 8×4, 8×8, 8×16, 16×8, and 16×16). In addition JVT also allows for 8×8 Intra subblocks, thus complicating things even further.

Considering the common cases of JVT and MPEG-4/H.263 (8×8 and 16×16), the predictor set for a 16×16 macroblock is illustrated in FIGS. 16a-c having a similar arrangement to FIGS. 15a-c , respectively. Here, Motion Vector predictors are shown for one MV with 8×8 partitions. Even though the described predictors could give reasonable results in some cases, it appears that they may not adequately cover all possible predictions.

Attention is drawn next to FIGS. 17a-c , which are also in a similar arrangement to FIGS. 15a-c , respectively. Here, in FIGS. 17a-c there are two additional predictors that could also be considered in the prediction phase (C₁ and A₂). If 4×4 blocks are also considered, this increases the possible predictors by four.

Instead of employing a median of the three predictors A, B, and C (or A₁, B, and C₂) one may now have some additional, and apparently more reliable, options. Thus, for example, one can observe that predictors A₁, and C₂ are essentially too close with one another and it may be the case that they may not be too representative in the prediction phase. Instead, selecting predictors A₁, C₁, and B seems to be a more reliable solution due to their separation. An alternative could also be the selection of A₂ instead of A₁ but that may again be too close to predictor B. Simulations suggest that the first case is usually a better choice. For the last column A₂ could be used instead of A₁. For the first row either one of A and A₂ or even their average value could be used. Gain up to 1% was noted within JVT with this implementation.

The previous case adds some tests for the last column. By examining FIG. 17b , for example, it is obvious that such tends to provide the best partitioning available. Thus, an optional solution could be the selection of A₂, C₁, and B (from the upper-left position). This may not always be recommended however, since such an implementation may adversely affect the performance of right predictors.

An alternative solution would be the usage of averages of predictors within a Macroblock. The median may then be performed as follows:

{right arrow over (MV)} _(pred)=Median(Ave({right arrow over (MV)} _(C) ₁ ,{right arrow over (MV)} _(C) ₂ ),Ave({right arrow over (MV)} _(A) ₁ ,{right arrow over (MV)} _(A) ₂ ),{right arrow over (MV)} _(B)).

For median row/column calculation, the median can be calculated as:

{right arrow over (MV)} _(pred)=Median(Median({right arrow over (MV)} _(C) ₁ ,{right arrow over (MV)} _(C) ₂ ,{right arrow over (MV)} _(D)), . . . ,Median({right arrow over (MV)}_(D) ,{right arrow over (MV)} _(A) ₁ ,{right arrow over (MV)} _(C) ₂ ),Median({right arrow over (MV)} _(B) ,{right arrow over (MV)} _(A) ₁ ,{right arrow over (MV)} _(A) ₂ ))

Another possible solution is a Median5 solution. This is probably the most complicated solution due to computation (quick-sort or bubble-sort could for example be used), but could potentially yield the best results. If 4×4 blocks arc considered, for example, then Median9 could also be used:

{right arrow over (MV)} _(pred)=Median({right arrow over (MV)} _(C) ₁ ,{right arrow over (MV)} _(C) ₂ ,{right arrow over (MV)} _(D) ,{right arrow over (MV)} _(B) ,{right arrow over (MV)} _(A) ₁ ,{right arrow over (MV)} _(A) ₂ )

Considering that JVT allows the existence of Intra subblocks within an Inter Macroblock (e.g., tree macroblock structure), such could also be taken in consideration within the Motion Prediction. If a subblock (e.g., from Macroblocks above or left only) to be used for the MV prediction is Intra, then the adjacent subblock may be used instead. Thus, if A₁ is intra but A₂ is not, then A₁ can be replaced by A₂ in the prediction. A further possibility is to replace one missing Intra Macroblock with the MV predictor from the upper-left position. In FIG. 17a , for example, if C₁ is missing then D may be used instead.

In the above sections, several improvements on B picture Direct Mode and on Motion Vector Prediction were presented. It was illustrated that spatial prediction can also be used for Direct Mode macroblocks; where as Motion Vector prediction should consider temporal distance and subblock information for more accurate prediction. Such considerations should significantly improve the performance of any applicable video coding system.

CONCLUSION

Although the description above uses language that is specific to structural features and/or methodological acts, it is to be understood that the invention defined in the appended claims is not limited to the specific features or acts described. Rather, the specific features and acts are disclosed as exemplary forms of implementing the invention. 

1.-117. (canceled)
 118. A computing device comprising one or more processing units, volatile memory, non-volatile memory, and storage, the non-volatile memory and/or storage having stored therein computer-executable instructions for causing the computing device, when programmed thereby, to perform operations comprising: receiving encoded data for a current frame in a sequence of video frames; and decoding the current frame, including, for a given block of the current frame, wherein the given block uses a first reference frame that has a first temporal distance from the current frame: determining a predicted motion vector (“MV”) for the given block using multiple MV predictors from the current frame, including: determining a first MV predictor from a first surrounding block of the current frame, wherein the first MV predictor uses a second reference picture that has a second temporal distance from the current frame; scaling the first MV predictor according to the first temporal distance and the second temporal distance; determining a second MV predictor from a second surrounding block of the current frame, wherein the second MV predictor uses a third reference frame that has a third temporal distance from the current frame; and scaling the second MV predictor according to the first temporal distance and the third temporal distance; and performing motion compensation for the given block relative to the first reference frame to determine a motion-compensated prediction for the given block.
 119. The computing device of claim 118, wherein the first surrounding block is left of the given block, and wherein the second surrounding block is above the given block.
 120. The computing device of claim 118, wherein the scaling the first MV predictor includes dividing by the second temporal distance and multiplying by the first temporal distance.
 121. The computing device of claim 118, wherein the scaling the second MV predictor includes dividing by the third temporal distance and multiplying by the first temporal distance.
 122. The computing device of claim 118, wherein the decoding further includes, for the given block: decoding a MV difference between an actual MV for the given block and the predicted MV; and combining the MV difference and the predicted MV.
 123. The computing device of claim 118, wherein the decoding further includes, for the given block: decoding a residual for the given block; and combining the residual and the motion-compensated prediction.
 124. The computing device of claim 118, wherein the motion compensation uses the predicted MV for the given block, and wherein the decoding further includes, for the given block, selecting the first reference frame from among reference frames used for multiple surrounding blocks of the current frame, the multiple surrounding blocks including the first surrounding block and the second surrounding block.
 125. In a computer system that implements a video decoder, a method comprising: receiving encoded data for a current frame in a sequence of video frames; and decoding the current frame, including, for a given block of the current frame, wherein the given block uses a first reference frame that has a first temporal distance from the current frame: determining a predicted motion vector (“MV”) for the given block using multiple MV predictors from the current frame, including: determining a first MV predictor from a first surrounding block of the current frame, wherein the first MV predictor uses a second reference picture that has a second temporal distance from the current frame; scaling the first MV predictor according to the first temporal distance and the second temporal distance; determining a second MV predictor from a second surrounding block of the current frame, wherein the second MV predictor uses a third reference frame that has a third temporal distance from the current frame; and scaling the second MV predictor according to the first temporal distance and the third temporal distance; and performing motion compensation for the given block relative to the first reference frame to determine a motion-compensated prediction for the given block.
 126. The method of claim 125, wherein the first surrounding block is left of the given block, and wherein the second surrounding block is above the given block.
 127. The method of claim 125, wherein the scaling the first MV predictor includes dividing by the second temporal distance and multiplying by the first temporal distance.
 128. The method of claim 125, wherein the scaling the second MV predictor includes dividing by the third temporal distance and multiplying by the first temporal distance.
 129. The method of claim 125, wherein the decoding further includes, for the given block: decoding a MV difference between an actual MV for the given block and the predicted MV; and combining the MV difference and the predicted MV.
 130. The method of claim 125, wherein the decoding further includes, for the given block: decoding a residual for the given block; and combining the residual and the motion-compensated prediction.
 131. The method of claim 125, wherein the motion compensation uses the predicted MV for the given block, and wherein the decoding further includes, for the given block, selecting the first reference frame from among reference frames used for multiple surrounding blocks of the current frame, the multiple surrounding blocks including the first surrounding block and the second surrounding block.
 132. A computing device comprising one or more processing units, volatile memory, non-volatile memory, and storage, the non-volatile memory and/or storage having stored therein computer-executable instructions for causing the computing device, when programmed thereby, to perform operations comprising: encoding a current frame in a sequence of video frames, including, for a given block of the current frame, wherein the given block uses a first reference frame that has a first temporal distance from the current frame: determining a predicted motion vector (“MV”) for the given block using multiple MV predictors from the current frame, including: determining a first MV predictor from a first surrounding block of the current frame, wherein the first MV predictor uses a second reference picture that has a second temporal distance from the current frame; scaling the first MV predictor according to the first temporal distance and the second temporal distance; determining a second MV predictor from a second surrounding block of the current frame, wherein the second MV predictor uses a third reference frame that has a third temporal distance from the current frame; and scaling the second MV predictor according to the first temporal distance and the third temporal distance; and performing motion compensation for the given block relative to the first reference frame to determine a motion-compensated prediction for the given block; and outputting encoded data for the current frame.
 133. The computing device of claim 132, wherein the first surrounding block is left of the given block, and wherein the second surrounding block is above the given block.
 134. The computing device of claim 132, wherein the scaling the first MV predictor includes dividing by the second temporal distance and multiplying by the first temporal distance.
 135. The computing device of claim 132, wherein the scaling the second MV predictor includes dividing by the third temporal distance and multiplying by the first temporal distance.
 136. The computing device of claim 132, wherein the encoding further includes, for the given block: calculating a MV difference between an actual MV for the given block and the predicted MV; and encoding the MV difference.
 137. The computing device of claim 132, wherein the encoding further includes, for the given block: determining a residual for the given block; and encoding the residual. 